Patch-based, iteratively-reweighted compressive recovery for reconstruction of highly accelerated exercise stress cardiac cine
نویسندگان
چکیده
Background Real-time exercise stress cardiac magnetic resonance imaging is challenging due to exaggerated breathing motion and high heart rates; improvements in image reconstruction may help improve the reliability and diagnostic accuracy of this difficult imaging application. Cardiac images possess a rich structure that can be exploited to aid image reconstruction by enforcing sparsity in an appropriate transformed domain, e.g., in the undecimated wavelet transform (UWT) domain). When using UWT or its decimated counterpart, standard techniques achieve L1 regularization through the use of a single weighting rule (regularization strength) across different sub-bands [1]. Since the level of sparsity varies across sub-bands, it has been shown that iteratively adapting the individual regularization strength for each sub-band can improve the recovery process [2]. However, levels of sparsity may vary significantly not only between but also within sub-bands, and taking advantage of this finer-grained variation may further improve reconstruction results, especially in scenarios where severe motion is present. In this work, we demonstrate that the use of a patch-based iteratively reweighted approach, in which regularization strength is adapted for each spatiotemporal patch in the transformed domain, can improve image reconstruction of exercise stress cardiac images relative to standard compressive recovery techniques.
منابع مشابه
A L1-Minimization for Image Reconstruction from Compressed Sensing
We proposed a simple and efficient iteratively reweighted algorithm to improve the recovery performance for image reconstruction from compressive sensing (CS). The numerical experiential results demonstrate that the new proposed method outperforms in image quality and computation complexity, compared with standard l1-minimization and other iteratively reweighted l1-algorithms when applying for ...
متن کاملFast Iteratively Reweighted Least Squares Algorithms for Analysis-Based Sparsity Reconstruction
In this paper, we propose a novel algorithm for analysis-based sparsity reconstruction. It can solve the generalized problem by structured sparsity regularization with an orthogonal basis and total variation regularization. The proposed algorithm is based on the iterative reweighted least squares (IRLS) model, which is further accelerated by the preconditioned conjugate gradient method. The con...
متن کاملNon-Negative Matrix Factorisation of Compressively Sampled Non-Negative Signals
The new emerging theory of Compressive Sampling has demonstrated that by exploiting the structure of a signal, it is possible to sample a signal below the Nyquist rate and achieve perfect reconstruction. In this short note, we employ Non-negative Matrix Factorisation in the context of Compressive Sampling and propose two NMF algorithms for signal recovery—one of which utilises Iteratively Rewei...
متن کاملRecovery of Non-Negative Signals from Compressively Sampled Observations Via Non-Negative Quadratic Programming
The new emerging theory of Compressive Sampling has demonstrated that by exploiting the structure of a signal, it is possible to sample a signal below the Nyquist rate and achieve perfect reconstruction. In this paper, we consider a special case of Compressive Sampling where the uncompressed signal is non-negative, and propose an extension of Non-negative Quadratic Programming—which utilises It...
متن کاملAccelerated Cardiac Cine Using Locally Low Rank and Total Variation Constraints
INTRODUCTION: Simultaneously achieving high spatial and temporal resolution remains a challenge in 3D cardiac cine imaging. Constrained reconstruction promoting the low rank property of dynamic image matrices has been proposed for accelerated dynamic MRI [1,2]. Recently, locally low rank (LLR) constraint was proposed to exploit spatially-varied local rank-deficiency [3]. Moreover, the combinati...
متن کامل